Quantum Hashing. Group approach
نویسندگان
چکیده
منابع مشابه
A Group Testing Approach to Improved Corruption Localizing Hashing
Efficient detection of integrity violations is crucial for the reliability of both data at rest and data in transit. While ideally one would want to always find all changes in the input data, in practice this capability may be expensive, and one may be content with localizing or finding a superset of any changes. Corruption-localizing hashing [5] is a cryptographic primitive that enhances colli...
متن کاملQuantum Communications Based on Quantum Hashing
In this paper we consider an application of the recently proposed quantum hashing technique for computing Boolean functions in the quantum communication model. The combination of binary functions on non-binary quantum hash function is done via polynomial presentation, which we have called a characteristic of a Boolean function. Based on the characteristic polynomial presentation of Boolean func...
متن کاملQuantum Hashing via Classical $\epsilon$-universal Hashing Constructions
We define the concept of a quantum hash generator and offer a design, which allows one to build a large number of different quantum hash functions. The construction is based on composition of a classical ǫ-universal hash family and a given family of functions – quantum hash generators. The relationship between ǫ-universal hash families and error-correcting codes give possibilities to build a la...
متن کاملQuantum Hashing for Finite Abelian Groups
We propose a generalization of the quantum hashing technique based on the notion of the small-bias sets. These sets have proved useful in different areas of computer science, and here their properties give an optimal construction for succinct quantum presentation of elements of any finite abelian group, which can be used in various computational and cryptographic scenarios. The known quantum fi...
متن کاملAn Ensemble Diversity Approach to Binary Hashing
Introduction Information retrieval tasks such as searching for a query image or document in a database are essentially a nearest-neighbor search. When the dimensionality of the query and the size of the database is large, approximate search is necessary. We focus on binary hashing, where the query and database are mapped onto low-dimensional binary vectors, where the search is performed. This h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lobachevskii Journal of Mathematics
سال: 2016
ISSN: 1995-0802,1818-9962
DOI: 10.1134/s1995080216020165